An algorithm reconstructing convex lattice sets
نویسندگان
چکیده
منابع مشابه
An algorithm reconstructing convex lattice sets
In this paper, we study the problem of reconstructing special lattice sets from X-rays in a finite set of prescribed directions. We present the class of “Q-convex” sets which is a new class of subsets of Z2 having a certain kind of weak connectedness. The main result of this paper is a polynomial-time algorithm solving the reconstruction problem for the “Q-convex” sets. These sets are uniquely ...
متن کاملReconstructing Convex Sets from Support Line Measurements
Abstruct-This paper proposes algorithms for reconstructing convex sets given noisy support line measurements. We begin by observing that a set of measured support lines may not be consistent with any set in the plane. We then develop a theory of consistent support lines which serves as a basis for reconstruction algorithms that take the form of constrained optimization algorithms. The formal st...
متن کاملReconstructing Convex Sets from Support Line Measurements
This paper proposes algorithms for reconstructing convex sets given noisy support line measurements. We begin by observing that a set of measured support lines may not be consistent with any set in the plane. We then develop a theory of consistent support lines which serves as a basis for reconstruction algorithms that take the form of constrained optimization algorithms. The formal statement o...
متن کاملAn Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays
We study the problem of reconstructing finite subsets of the integer lattice Z from their approximate X-rays in a finite number of prescribed lattice directions. We provide a polynomial-time algorithm for reconstructing Q-convex sets from their “approximate” X-rays. A Qconvex set is a special subset of Z having some convexity properties. This algorithm can be used for reconstructing convex subs...
متن کاملThe lattice of convex sets of an oriented matroid
In this paper we further investigate the structure of the convex sets of an acyclic oriented matroid. This subject was first explored by Las Vergnas [6]. The main tool of our study is the theory of the anti-exchange closure [2]. We show that the convex closure of Las Vergnas satisfies the anti-exchange law in the case where the matroid is a geometry. From this we are able to detail the structur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00050-1